Performance Evaluation of improved Algorithm for WirelessSensor Networks

Wireless sensor networks have recently come into prominence because they hold the potential to revolutionize many segments of our economy and life, from environmental monitoring and conservation, to manufacturing and business asset management, to automation in the transportation and health-care industries. Information collected by and transmitted on a sensor network describes conditions of physical environments for example, temperature, humidity, or vibration and requires advanced query interfaces and search engines to effectively support user-level functions. Wireless sensor nodes can be deployed in various regions to collect the information but they have limitations like Limited power they can harvest, ability to cope with node failures (node failure problem), mobility of nodes, communication failures, heterogeneity of nodes, large scale of deployment and Load balancing problem. Node capacity is scalable, only limited by bandwidth of gateway node. These are the existing problems in Wireless sensor nodes .The proposed algorithm in this paper handles load balancing, lifetime and mobility of nodes problems .The work has been simulated on OMNeT++ 4.0 simulator on Linux platform. And finally we have compared some results with an existing algorithm like Threshold sensitive Energy Efficient sensor Network algorithm and Low Energy Adaptive Clustering Hierarchy algorithm and have carried out comparisons/investigation on various parameters like average time for first node to die, network lifetime etc, the results are shown better in some cases for this proposed algorithm.